On processing reverse k-skyband and ranked reverse skyline queries
نویسندگان
چکیده
منابع مشابه
Parallel Computation of Skyline and Reverse Skyline Queries Using MapReduce
The skyline operator and its variants such as dynamic skyline and reverse skyline operators have attracted considerable attention recently due to their broad applications. However, computations of such operators are challenging today since there is an increasing trend of applications to deal with big data. For such data-intensive applications, the MapReduce framework has been widely used recent...
متن کاملEfficient Computation of Reverse Skyline Queries
In this paper, for the first time, we introduce the concept of Reverse Skyline Queries. At first, we consider for a multidimensional data set P the problem of dynamic skyline queries according to a query point q. This kind of dynamic skyline corresponds to the skyline of a transformed data space where point q becomes the origin and all points of P are represented by their distance vector to q. ...
متن کاملReverse k-skyband query based on reuse technology
In this paper, we introduce a new approach to finish reverse k-skyband (RkSB) query which returns all the points in given dataset P whose dynamic k-skyband contains specific query object q. The main ideas include reuse technology and early stopping. The former save the information of node accesses during R-tree search into an auxiliary heap so that dramatically decreases the I/O cost and improv...
متن کاملOn Processing of Continuous Bichromatic Reverse k-Nearest-Neighbor Queries
Bichromatic Reverse k-Nearest-Neighbor (BRkNN) query is a variant of the Reverse k-Nearest-Neighbor (RkNN) query that involves a set of service sites (e.g. gas stations) and a set of customer points (e.g. vehicles). It has many applications in Location-Based Services, in particular in mobile advertising. This paper investigates the processing of continuous BRkNN (CBRkNN) queries where the point...
متن کاملReverse k-Ranks Queries on Large Graphs
Given a collection of objects, the reverse k-ranks query takes as input a query object q in the set and returns the top-k objects that rank q higher compared to where other objects rank q. This query has been studied in the vector space, however, there is no previous work in the context of graphs. In this paper, we propose a filterand-refinement framework, which prunes the search space while tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2015
ISSN: 0020-0255
DOI: 10.1016/j.ins.2014.08.052